Predictive Prefetching for Parallel Hybrid Storage Systems
نویسندگان
چکیده
منابع مشابه
Predictive Prefetching for Parallel Hybrid Storage Systems
In this paper, we present a predictive prefetching mechanism that is based on probability graph approach to perform prefetching between different levels in a parallel hybrid storage system. The fundamental concept of our approach is to invoke parallel hybrid storage system’s parallelism and prefetch data among multiple storage levels (e.g. solid state disks, and hard disk drives) in parallel wi...
متن کاملHybrid Regenerating Codes for Distributed Storage Systems
Distributed storage systems are mainly justified due to their ability to store data reliably over some unreliable nodes such that the system can have long term durability. Recently, regenerating codes are proposed to make a balance between the repair bandwidth and the storage capacity per node. This is achieved through using the notion of network coding approach. In this paper, a new variation ...
متن کاملAccelerating MCMC via Parallel Predictive Prefetching
Parallel predictive prefetching is a new framework for accelerating a large class of widelyused Markov chain Monte Carlo (MCMC) algorithms. It speculatively evaluates many potential steps of an MCMC chain in parallel while exploiting fast, iterative approximations to the target density. This can accelerate sampling from target distributions in Bayesian inference problems. Our approach takes adv...
متن کاملPractical Prefetching Techniques for Parallel File Systems
Improvements in the processing speed of multipro cessors are outpacing improvements in the speed of disk hardware Parallel disk I O subsystems have been proposed as one way to close the gap between proces sor and disk speeds In a previous paper we showed that prefetching and caching have the potential to de liver the performance bene ts of parallel le systems to parallel applications In this pa...
متن کاملAccelerating Markov chain Monte Carlo via parallel predictive prefetching
We present a general framework for accelerating a large class of widely used Markov chain Monte Carlo (MCMC) algorithms. This dissertation demonstrates that MCMC inference can be accelerated in a model of parallel computation that uses speculation to predict and complete computational work ahead of when it is known to be useful. By exploiting fast, iterative approximations to the target density...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Communications, Network and System Sciences
سال: 2015
ISSN: 1913-3715,1913-3723
DOI: 10.4236/ijcns.2015.85018